Counterexample-Guided Control
نویسندگان
چکیده
A major hurdle in the algorithmic veri cation and control of systems is the need to nd suitable abstract models, which omit enough details to overcome the state-explosion problem, but retain enough details to exhibit satisfaction or controllability with respect to the speci cation. The paradigm of counterexample-guided abstraction re nement suggests a fully automatic way of nding suitable abstract models: one starts with a coarse abstraction, attempts to verify or control the abstract model, and if this attempt fails and the abstract counterexample does not correspond to a concrete counterexample, then one uses the spurious counterexample to guide the re nement of the abstract model. We present a scheme for counterexample-guided re nement with the following properties. First, our scheme is the rst such method for control. The main diÆculty here is that in control, unlike in veri cation, counterexamples are strategies in a game between system and controller. Second, our scheme can be implemented symbolically and is therefore applicable to in nite-state systems. Third, in the case that the controller has no choices, our scheme subsumes the known algorithms for counterexample-guided veri cation. In particular, we present a symbolic algorithm that employs counterexample-guided abstraction re nement in a uniform way to check satisfaction as well as controllability for all linear-time speci cations (LTL or Buchi automata). Our algorithm is game-based and can be applied in all situations where games provide an adequate model, such as supervisory control, hardware and program synthesis and modular veri cation.
منابع مشابه
Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems
ion and Counterexample-Guided Refinement in Model Checking of Hybrid Systems∗ Edmund Clarke, Ansgar Fehnker, Zhi Han, Bruce Krogh, Joël Ouaknine, Olaf Stursberg, Michael Theobald 1 Computer Science Department, Carnegie Mellon University, Pittsburgh, PA 15213, USA 2 Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA 15213, USA 3 Process Control Lab, University of Dor...
متن کاملAbstraction Refinement for Termination
ion Refinement for Termination⋆ Byron Cook, Andreas Podelski, and Andrey Rybalchenko 1 Microsoft Research, Cambridge 2 Max-Planck-Institut für Informatik, Saarbrücken Abstract. Abstraction can often lead to spurious counterexamples. Counterexample-guided abstraction refinement is a method of strengthening abstractions based on the analysis of these spurious counterexamples. For invariance prope...
متن کاملCounterexample-Guided Abstraction Refinement for PLCs
This paper presents a method for model checking programs for programmable logic controllers (PLCs) using the counterexample-guided abstraction refinement (CEGAR) approach. The technique is tailored to this specific hardware platform by accounting for the cyclic scanning mode that is symptomatic to PLCs. In particular, the hardware model poses the need for on-the-fly abstraction refinement in or...
متن کاملVerification of a Cruise Control System using Counterexample-Guided Search
Formal verification has been identified by the research community as a useful step in logic controller design since it reveals algorithmically whether the controller in conjunction with the controlled plant satisfies given design specifications. If it is necessary, however, to model the continuous/hybrid behavior of the plant, the verification is a computationally expensive task, thus limiting ...
متن کاملScalable Hardware Verification based on Datapath Abstraction, Counterexample-Guided Refinement, and Satisfiability Modulo Theories
We describe the Reveal formal functional verification system and its application to three representative hardware test cases. Reveal employs counterexample-guided abstraction refinement, or CEGAR, and is suitable for verifying the complex control logic of designs with wide datapaths. Reveal performs automatic datapath abstraction yielding an approximation of the original design with a much smal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003